A Matrix Euclidean Algorithm induced by State Space Realization

نویسندگان

  • Brian M. Allen
  • Joachim Rosenthal
چکیده

An eecient algorithm is developed for determining the greatest common left divisor (GCLD) of two polynomial matrices. Knowing this divisor allows for several immediate applications: In coding theory, a noncatastrophic convolutional encoder can be derived from an arbitrary one. In systems theory, irreducible matrix fraction descriptions of transfer function matrices can be found. In linear algebra, the greatest common divisor can be seen as a basis for a free module generated by the columns of the matrices. The approach taken is based on recent ideas from systems theory. A minimal state space realization is obtained with minimal calculations, and from this the controllability matrix is analyzed to produce the GCLD. It will be shown that the derived algorithm is a natural extension of the Euclidean algorithm to the matrix case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-Gyrogroup: The Group-Like Structure Induced by Bi-Decomposition of Groups

‎The decomposition $Gamma=BH$ of a group $Gamma$ into a subset B ‎and a subgroup $H$ of $Gamma$ induces‎, ‎under general conditions‎, ‎a ‎group-like structure for B‎, ‎known as a gyrogroup‎. ‎The famous‎ concrete realization of a gyrogroup‎, ‎which motivated the emergence ‎of gyrogroups into the mainstream‎, ‎is the space of all ‎relativistically admissible velocities along with a binary ‎mbox{...

متن کامل

Matrix factorization and minimal state space realization in the max-plus algebra

The topics of this paper are matrix factorizations and the minimal state space realization problem in the maxplus algebra, which is one of the modeling frameworks that can be used to model discrete event systems. We present a heuristic algorithm to compute a factorization of a matrix in the max-plus algebra. Next we use this algorithm to determine the minimal system order (and to construct a mi...

متن کامل

Large Matrix Inversion using State Space Techniques

A new computational technique is presented by which large structured matrices can be inverted. The specified matrix is viewed as the input-output operator of a time-varying system. Recently developed state space algorithms which apply to such systems are then used to compute a QR factorization first and subsequently the inverse of the matrix, starting from a state realization of the matrix. The...

متن کامل

Tangent Bundle of the Hypersurfaces in a Euclidean Space

Let $M$ be an orientable hypersurface in the Euclidean space $R^{2n}$ with induced metric $g$ and $TM$ be its tangent bundle. It is known that the tangent bundle $TM$ has induced metric $overline{g}$ as submanifold of the Euclidean space $R^{4n}$ which is not a natural metric in the sense that the submersion $pi :(TM,overline{g})rightarrow (M,g)$ is not the Riemannian submersion. In this paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999